Bounded Positive Solutions of Schrödinger Equations in Two-Dimensional Exterior Domains

We prove under quite general assumptions the existence of a bounded positive solution to the semilinear Schrödinger equation in a two-dimensional exterior domain.     

一种改进的自适应模糊阈值图象分割方法

自适应模糊阈值图象分割方法的关键和困难在于隶属函数窗宽的自动调整和阈值搜索范围的确定.依靠图象灰度的统计特性初步确定阈值搜索范围，提出了一种改进方法，进而得到隶属函数的窗宽.实验表明这种方法避免了确定图象灰度直方图峰位置的困难，对较低亮度图象分割效果良好.     

Mean curvature flows and isotopy of maps between spheres

Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area‐decreasing map between unit spheres (of possibly different dimensions) is isotopic to a constant map. © 2004 Wiley Periodicals, Inc.     

神经网络法计算镉（Ⅱ）,羟基及碳酸根三元体系的形态分布

采用前馈线笥网络ＢＰ算法，计算了Ｃｄ６２＋－ＯＨ＾－ＣＯ＾２－３三元体系的累积稳定常数。用Ｈｏｐｆｉｅｌｄ反馈网络研究了体系中络合物的形态分布。溶液中溶解的ＣＯ２对ｌｇβ１的计算结果有重要影响，对ｌｇβ２，ｌｇβ３，ｌｇβ４的结果影响不大。     

第I类非自共轭锥上的Gamma函数

本文将Ｇａｍｍａ函数及Ｓｉｅｇｅｌ积分推广到一般的第Ｉ类非自共轭锥上．作为其应用，显式给出了以这些锥为底的管状域（或第一类Ｓｉｅｇｅｌ域）的Ｃａｕｃｈｙ Ｓｚｅｇ¨ｏ核和形式Ｐｏｉｓｏｎ核．     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

防紫外线伞ATR-OMNI采样器的FTIR分析

本实验使用OMNI采样器，直接对伞面内外进行单反射ATR的分析，快速、简便、不破坏样品，得到分辨率很好的红外图谱，再配合红外谱库的谱图检索，可以分别得到匹配率95％以上的尼龙－6和聚酯型聚氨酯的分析结果。     

一类Narcissistic反应过渡态的优化

我们对一类narcissistic 反应XCH_2-CH_2Y→[过渡态TS]→YCH_2—CH_2X (1)进行了研究,结果表明其过渡态能在对称性限制下由能量极小化方法较容易地给出. 采用IMSPAK分子轨道从头算程序,在IBM VM/370计算机系统上用STO—3G极小基组以平衡几何构型的能量梯度优化方法,在对称性限制下对反应(1)的几种反应体系的过渡态构型进行了优化,其结果列于表1.     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).